A high-speed integrated circuit with applications to RSA Cryptography

Merged with duplicate record 10026.1/833 on 01.02.2017 by CS (TIS)The rapid growth in the use of computers and networks in government, commercial and private communications systems has led to an increasing need for these systems to be secure against unauthorised access and eavesdropping. To this end, modern computer security systems employ public-key ciphers, of which probably the most well known is the RSA ciphersystem, to provide both secrecy and authentication facilities. The basic RSA cryptographic operation is a modular exponentiation where the modulus and exponent are integers typically greater than 500 bits long. Therefore, to obtain reasonable encryption rates using the RSA cipher requires that it be implemented in hardware. This thesis presents the design of a high-performance VLSI device, called the WHiSpER chip, that can perform the modular exponentiations required by the RSA cryptosystem for moduli and exponents up to 506 bits long. The design has an expected throughput in excess of 64kbit/s making it attractive for use both as a general RSA processor within the security function provider of a security system, and for direct use on moderate-speed public communication networks such as ISDN. The thesis investigates the low-level techniques used for implementing high-speed arithmetic hardware in general, and reviews the methods used by designers of existing modular multiplication/exponentiation circuits with respect to circuit speed and efficiency. A new modular multiplication algorithm, MMDDAMMM, based on Montgomery arithmetic, together with an efficient multiplier architecture, are proposed that remove the speed bottleneck of previous designs. Finally, the implementation of the new algorithm and architecture within the WHiSpER chip is detailed, along with a discussion of the application of the chip to ciphering and key generation

Riflessioni su alcune scelte traduttive in lingua inglese (Morris, Tinker, Tolkien, Heaney e Porter)

This essay takes into account some English translations of the Old English poem Beowulf. Matter of specific investigation is the passage of the coming of Grendel to the Danes' court Heorot. As the translations of Beowulf are countless, only specific and emblematic cases – both in prose and verse – are analysed. Then, the translations by William Morris, Chancey Brewster Tinker, J.R.R. Tolkien, Seamus Heaney and John Porter are compared trying to ascertain the approach of those translators to the Old English text and furthermore the intentions they had in rendering the poem into Modern English. The big problem that all the translators consciously tackled was the chronological and linguistic distance of Beowulf that had to be solved in some way. Choices and strategies differ from one version to another, but every solution demonstrates a specific attention to the musicalness of the original together with a deep awareness for the tradition that the Old English poem embodies